Amazon SDE1 | March 2021 and December 2021 | India

Interviewed at Amazon twice as mentioned in title. Rejected first time and got offer second time.

Online Assesment: 2 hours 2 codes with explanation and time space complexities analysis
and work style assesment (many questions) followed by optional feedback

1. Find shortest path in grid (BFS)
2. Priority queue/ heap question arrange orders as per given requirement : basically need to make logic for customized comparator function of priority_queue

Got the call from recruiter and it was kind of phone screening round. BFS, Binary Search Tree
Got the mail of rounds scheduled after a week

• Round 1 HM Round :
  Started with intro followed by my current work and responsibilities,
  Some questions on OS, OOP
  Followed by microservice related questions answered basic questions as per my understanding and experience.
  LP questions related to previous projects
  Why Amazon
  NO CODES ASKED

• Round 2 SDE, very friendly, started with DSA only
  Related to tree traversal, related to level order traversal
  Disjoint set data structure related question
  Last 15 min: LP question on customer obsession

• Round 3 SDE and one unknown person just observing, again very friendly
  started with codes
  Little hard: Find subsets having same avg (can be solved using DP)
  Again traversal related question with some variants. Forgot the question but solved it
  Seems fine to him, last 15 min LP ques. => Learned something new for the job?

After 4 days, got the call for final round

• Round 4 SDM, Introduction followed by 2 Codes
  Solved both too quickly
  Triangluar traverasal of tree
  Merge k Sorted Arrays
  He wasn't asking much but I should have spoke a lot in between (I solved both but spoke a little less compared to other rounds as he seemed passive)
  LP: Mostly negative questions only
  Critical comment you got
  Some abnormal way or hack used to solve some problem/ complete task

Result : Rejected with no feedback. I did not expect that but I did not have good stories for last round LPs and did not practice speaking out loud for codes.

December 2021

Similar process
Online Assesment : same format and same topics BFS and Heap
Onsite 1 2 Easy codes based on binary search and map
Onsite 2 LRU Cache implementation: open ended discusssion on approaches and implementation
Onsite 3 HM Round. Standard LPs and OS Memory management related questions
Onsite 4 BR LPs for first half and DSA question related to Symmetric Tree for second half